Partial-Order Reduction for Supervisory Controller Synthesis

نویسندگان

چکیده

A key challenge in the synthesis and subsequent analysis of supervisory controllers is impact state-space explosion caused by concurrency. The main bottleneck often memory needed to store composition plant requirement automata resulting supervisor. Partial-order reduction (POR) a well-established technique that alleviates this issue field model checking. It does so exploiting redundancy with respect properties interest. For controller synthesis, functional interest are nonblockingness, controllability, least-restrictiveness, but also performance properties, such as throughput latency We propose an on-the-fly POR on input preserves both synthesized controller. This improves scalability (and any analysis). Synthesis experiments show effectiveness set realistic manufacturing system models.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Abstraction Based Supervisory Controller Synthesis for High Order Monotone Continuous Systems

ion Based Supervisory Controller Synthesis for High Order Monotone Continuous Systems Thomas Moor1 and Jörg Raisch2 1 Research School of Information Sciences and Engineering Australian National University, Canberra 2 Lehrstuhl für Systemtheorie technischer Prozesse Otto-von-Guericke Universität Magdeburg, and Systems and Control Theory Group Max-Planck-Institut für Dynamik komplexer technischer...

متن کامل

Supervisory Controller Synthesis for Product Lines Using CIF 3

Using the CIF 3 toolset, we illustrate the general idea of controller synthesis for product line engineering for a prototypical example of a family of coffee machines. The challenge is to integrate a number of given components into a family of products such that the resulting behaviour is guaranteed to respect an attributed feature model as well as additional behavioural requirements. The propo...

متن کامل

Partial Order Reduction for Planning

OF THE THESIS Partial Order Reduction for Planning by You Xu Master of Science in Computer Science Washington University in St. Louis, 2009 Research Advisor: Professor Yixin Chen Partial Order Reduction (POR) is a technique that reduces the search space by recognizing interchangeable orders between actions and expanding only a subset of all possible orders during the search. It has been extensi...

متن کامل

Static Partial Order Reduction

1 I n t r o d u c t i o n One c o m m o n me thod for dealing with the intrinsically intractable computa t iona l complexi ty of model-checking asynchronous systems is partial order reduction. This reduct ion technique exploits the c o m m o n practice of model ing concurrent events in asynchronous systems as an interleaving of the events in all possible execution orders. An impor t an t observ...

متن کامل

Cartesian Partial-Order Reduction

Verifying concurrent programs is challenging since the number of thread interleavings that need to be explored can be huge even for moderate programs. We present a cartesian semantics that reduces the amount of nondeterminism in concurrent programs by delaying unnecessary context switches. Using this semantics, we construct a novel dynamic partial-order reduction algorithm. The cartesian semant...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Automatic Control

سال: 2022

ISSN: ['0018-9286', '1558-2523', '2334-3303']

DOI: https://doi.org/10.1109/tac.2021.3129161